Tilings of convex polygons by equilateral triangles of many different sizes
نویسندگان
چکیده
منابع مشابه
Unilateral and equitransitive tilings by equilateral triangles
A tiling of the plane by polygons is unilateral if each edge of the tiling is a side of at most one polygon of the tiling. A tiling is equitransitive if for any two congruent tiles in the tiling, there exists a symmetry of the tiling mapping one to the other. It is known that a unilateral and equitransitive (UE) tiling can be made with any finite number of congruence classes of squares. This ar...
متن کاملTilings of convex polygons
© Annales de l’institut Fourier, 1997, tous droits réservés. L’accès aux archives de la revue « Annales de l’institut Fourier » (http://annalif.ujf-grenoble.fr/) implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/legal.php). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier...
متن کاملDihedral F-Tilings of the Sphere by Equilateral and Scalene Triangles - II
The study of dihedral f-tilings of the Euclidean sphere S2 by triangles and rsided regular polygons was initiated in 2004 where the case r = 4 was considered [5]. In a subsequent paper [1], the study of all spherical f-tilings by triangles and r-sided regular polygons, for any r ≥ 5, was described. Later on, in [3], the classification of all f-tilings of S2 whose prototiles are an equilateral t...
متن کاملDihedral f-Tilings of the Sphere by Equilateral and Scalene Triangles - III
The study of spherical dihedral f-tilings by equilateral and isosceles triangles was introduced in [3]. Taking as prototiles equilateral and scalene triangles, we are faced with three possible ways of adjacency. In [4] and [5] two of these possibilities were studied. Here, we complete this study, describing the f-tilings related to the remaining case of adjacency, including their symmetry group...
متن کاملOnline Packing of Equilateral Triangles
We investigate the online triangle packing problem in which a sequence of equilateral triangles with different sizes appear in an online, sequential manner. The goal is to place these triangles into a minimum number of squares of unit size. We provide upper and lower bounds for the competitive ratio of online algorithms. In particular, we introduce an algorithm which achieves a competitive rati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2020
ISSN: 0012-365X
DOI: 10.1016/j.disc.2019.111745